Recursive Direct Optimization and Successive Refinement in Multistage Stochastic Programs

نویسندگان

  • MARC C. STEINBACH
  • Marc C. Steinbach
  • M. C. Steinbach
چکیده

The paper presents a new algorithmic approach for multistage stochastic programs which are seen as discrete optimal control problems with a characteristic dynamic structure induced by the scenario tree. To exploit that structure, we propose a highly eecient dynamic programming recursion for the computationally intensive task of KKT systems solution within a primal-dual interior point method. Convergence is drastically enhanced by a successive reenement technique providing both primal and dual initial estimates. Test runs on a multistage portfolio selection problem demonstrate the performance of the method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stochastic Programming: Convex Approximation and Modified Linear Decision Rule

Stochastic optimization, especially multistage models, is well known to be computationally excruciating. In this paper, we introduce the concept of semi-complete recourse in the context of stochastic programming as a less restrictive condition compared to complete recourse and propose methods for approximating multistage stochastic programs with risk constraints and semi-complete recourse. We e...

متن کامل

Recursive Direct Algorithms for Multistage Stochastic Programs in Financial Engineering

Multistage stochastic programs can be seen as discrete optimal control problems with a characteristic dynamic structure induced by the scenario tree. To exploit that structure, we propose a highly eecient dynamic programming recursion for the computationally intensive task of KKT systems solution within an interior point method. Test runs on a multistage portfolio selection problem demonstrate ...

متن کامل

On Dynamic Decomposition of Multistage Stochastic Programs

It is well known that risk-averse multistage stochastic optimization problems are often not in the form of a dynamic stochastic program, i.e. are not dynamically decomposable. In this paper we demonstrate how some of these problems may be extended in such a way that they are accessible to dynamic algorithms. The key technique is a new recursive formulation for the Average Value-atRisk. To this ...

متن کامل

Working Paper on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs on Augmented Lagrangian Decomposition Methods for Multistage Stochastic Programs

A general decomposition framework for large convex optimization problems based on augmented Lagrangians is described. The approach is then applied to multistage stochastic programming problems in two di erent ways: by decomposing the problem into scenarios and by decomposing it into nodes corresponding to stages. Theoretical convergence properties of the two approaches are derived and a computa...

متن کامل

Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs

We consider an interstage dependent stochastic process whose components follow an autoregressive model with time varying order. At a given time, we give some recursive formulæ linking future values of the process with past values and noises. We then consider multistage stochastic linear programs with uncertain sets depending affinely on such processes. At each stage, dealing with uncertainty us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998